#include<iostream>
#include<vector>
#include<queue>
#include<cstring>
#include<cmath>
#include<map>
#include<set>
#include<cstdio>
#include<algorithm>
#define debug(a) cout<<#a<<"="<<a<<endl;
using namespace std;
const int maxn=1e5+100;
typedef long long LL;
inline LL read(){LL x=0,f=1;char ch=getchar();	while (!isdigit(ch)){if (ch=='-') f=-1;ch=getchar();}while (isdigit(ch)){x=x*10+ch-48;ch=getchar();}
return x*f;}
LL a[maxn],sum[maxn];
int main(void)
{
  cin.tie(0);std::ios::sync_with_stdio(false);
  LL n;cin>>n;
  for(LL i=1;i<=n;i++){
    cin>>a[i];
  }
  sort(a+1,a+1+n);
  for(LL i=1;i<=n;i++) sum[i]=sum[i-1]+a[i];
  LL ans=1e18;
  for(LL i=1;i<=n;i++){
     LL k1=sum[i];LL k2=sum[n]-sum[i];
     if(k1<=k2){
       LL temp=k2-k1+1;
       ans=min(ans,max((LL)1,temp));
     }
     else{
        LL temp=k1-k2+1;
        ans=min(ans,max((LL)1,temp));
     }
  }
  cout<<ans<<"\n";
return 0;
}
